Hidden Costs in Avoiding False Sharing in Software DSMs

نویسندگان

  • K. V. Manjunath
  • R. Govindarajan
چکیده

Page based software DSMs experience high degrees of false sharing especially in irregular applications with fine grain sharing granularity. The overheads due to false sharing is considered to be the dominant factor limiting the performance of software DSMs. Several approaches have been proposed in the literature to reduce/eliminate false sharing. In this paper, we evaluate two of these approaches, viz., the Multiple Writer approach and Emulated Fine Grain Sharing (EmFiGS) approach. Our evaluation strategy is two pronged: firstly, we use a novel implementation independent analysis which uses overhead counts to compare the different approaches. The performance of EmFiGS approach is significantly worse, by a factor of 1.5 to as much as 90 times, compared to the Multiple Writer Approach. In many cases, EmFiGS approach performs worse that even a single writer lazy release protocol which experiences very high overheads due to false sharing. Our analysis shows that the benefits gained by eliminating false sharing are far outweighed by the performance penalty incurred due to the reduced exploitation of spatial locality in the EmFiGS approach. The implementation independent nature of our analysis implies that any implementation of the EmFiGS approach is likely to perform significantly worse than the Multiple Writer approach. Secondly, we use experimental evaluation to validate and complement our analysis. Experimental results match well with our analysis. Also the execution times of the application follow the same trend as in our analysis, reinforcing our conclusions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducing System Overheads in Home-based Software DSMs

Software DSM systems su er from the high communication and coherence-induced overheads that limit performance. This paper introduces our e orts in reducing system overheads of a home-based software DSM called JIAJIA. Three measures, including eliminating false sharing through avoiding unnecessarily invalidating cached pages, reducing virtual memory page faults with a new write detection scheme,...

متن کامل

Adjusting Single-/Multi-writer to False Sharing in Software DSMs

Two approaches are employed to deal with false sharing in software DSMs. Although single-writer is simple, it causes the ping-pong effect of the data page thrashing. In other hand, multiple-writer approach, which is eeective in re-duing the amount of page transfer, suuers from the high cost. This paper proposes a new approach to handle multiple writers in software DSMs called limited multiple-w...

متن کامل

Performance analysis of methods that overcome false sharing effects in software DSMs

Page-based software DSMs experience high degrees of false sharing especially in irregular applications with fine grain sharing granularity. The overheads due to false sharing is considered to be a dominant factor limiting the performance of software DSMs. Several approaches have been proposed in the literature to reduce/eliminate false sharing. In this paper, we evaluate two of these approaches...

متن کامل

A Data Reorganization Technique for Improving Data Locality of Irregular Applications in Software Distributed Shared Memory

Irregular applications are characterized by highly irregular and ne-grained data referencing patterns. When there is poor locality between the ne-grained data, serious false sharing can occur which has largely contributed to poor performance of irregular applications on page-based software distributed shared memory (DSM) systems. Partitioning data in irregular applications to improve data local...

متن کامل

To appear in the Third Symposium on Operating Systems Design and Implementation (OSDI `99) MultiView and Millipage { Fine-Grain Sharing in Page-Based DSMs

In this paper we develop a novel technique, calledMultiView, which enables implementation of page-based ne-grain dsms. We show how the traditional techniques for implementing page-based dsms can be extended to control the sharing granularity in a exible way, even when the size of the sharing unit varies, and is smaller than the operating system's page size. The run-time overhead imposed in the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001